DNA codes from skew dihedral group ring
نویسندگان
چکیده
<p style='text-indent:20px;'>In this work, we present a matrix construction for reversible codes derived from skew dihedral group rings. By employing construction, the ring <inline-formula><tex-math id="M1">\begin{document}$ \mathcal{F}_{j, k} $\end{document}</tex-math></inline-formula> and its associated Gray maps, show how one can construct of length id="M2">\begin{document}$ n2^{j+k} over finite field id="M3">\begin{document}$ \mathbb{F}_4. As an application, number DNA that satisfy Hamming distance, reverse, reverse-complement, GC-content constraints with better parameters than some good in literature.</p>
منابع مشابه
On Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملDual skew codes from annihilators: Transpose Hamming ring extensions
Linear codes may be endowed with cyclic structures by means of skew polynomial rings. This is the case of Piret cyclic convolutional codes [26] and the subsequent generalizations and alternatives (see [27], [14], [11], [25], [16], [20]). Non commutative cyclic structures of this kind have been also considered for block linear codes ([7], [5], [4], [12], [1]), and for linear codes over commutati...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملNon-commutative convolutional codes over the infinite dihedral group
Classic convolutional codes are defined as the convolution of a message and a transfer function over Z. In this paper, we study convolutional codes over the infinite dihedral group D∞. The goal of this study is to design convolutional codes with good and interesting properties and intended to be more resistant to code recognition. Convolution of two functions on D∞ corresponds to the product of...
متن کاملTwo Sided and Abelian Group Ring Codes
2 In the hallway of the university Wittgenstein asked a colleague: " I've always wondered why for so long people thought that the sun revolved around the earth. " " Why? " said his surprised interlocutor, " well, I suppose it just looks that way. " " Hmm " , retorted Wittgenstein, " and what would it look like if the earth revolved around the sun? " This puzzled the interlocutor.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics of Communications
سال: 2022
ISSN: ['1930-5346', '1930-5338']
DOI: https://doi.org/10.3934/amc.2022076